Perfect matchings in hexagonal systemsSACHS, H.Combinatorica (Print). 1984, Vol 4, Num 1, pp 89-99, issn 0209-9683Article

Matchings in graphs of size ℵAHARONI, R.Journal of combinatorial theory. Series B. 1984, Vol 36, Num 1, pp 113-117, issn 0095-8956Article

Leapfrog fullerenes have many perfect matchingsDOSLIC, Tomislav.Journal of mathematical chemistry. 2008, Vol 44, Num 1, pp 1-4, issn 0259-9791, 4 p.Article

THE PFAFFIAN AND 1-FACTORS OF GRAPHS IIGIBSON PM.1972; LECTURE NOTES MATH.; GERM.; DA. 1972; NO 303; PP. 89-98; BIBL. 6 REF.Serial Issue

EAR DECOMPOSITIONS OF ELEMENTARY GRAPHS AND GF₂-RANK OF PERFECT MATCHINGSNADDEF DJ; PULLEYBLANK WR.1982; NORTH-HOLL. MATH. STUD.; ISSN 0304-0208; NLD; DA. 1982; NO 66; PP. 241-260; BIBL. 9 REF.Conference Paper

Parallel concepts in graph theoryHARARY, F.Mathematical and computer modelling. 1993, Vol 18, Num 7, pp 101-105, issn 0895-7177Article

Matching and covering the vertices of a random graph by copies of a given graphRUCINSKI, A.Discrete mathematics. 1992, Vol 105, Num 1-3, pp 185-197, issn 0012-365XArticle

How to calculate the number of perfect matchings in finite sections of certain infinite plane graphsSACHS, H.Discrete mathematics. 1992, Vol 101, Num 1-3, pp 279-284, issn 0012-365XArticle

Perfect matchings extending on subcubes to Hamiltonian cycles of hypercubesGREGOR, Petr.Discrete mathematics. 2009, Vol 309, Num 6, pp 1711-1713, issn 0012-365X, 3 p.Article

On the maximum number of edges in a hypergraph with a unique perfect matchingBAL, Deepak; DUDEK, Andrzej; YILMA, Zelealem B et al.Discrete mathematics. 2011, Vol 311, Num 21, pp 2577-2580, issn 0012-365X, 4 p.Article

Characterizing minimally n-extendable bipartite graphsDINGJUN LOU.Discrete mathematics. 2008, Vol 308, Num 11, pp 2269-2272, issn 0012-365X, 4 p.Article

k-resonance of open-ended carbon nanotubesZHANG, Fuji; WANG, Lusheng.Journal of mathematical chemistry. 2004, Vol 35, Num 2, pp 87-103, issn 0259-9791, 17 p.Article

A generalization of Petersen's theoremGOEMANS, M. X.Discrete mathematics. 1993, Vol 115, Num 1-3, pp 277-282, issn 0012-365XArticle

ON PERFECT MATCHINGS IN UNIFORM HYPERGRAPHS WITH LARGE MINIMUM VERTEX DEGREEHAN, Hiêp; PERSON, Yury; SCHACHT, Mathias et al.SIAM journal on discrete mathematics (Print). 2010, Vol 23, Num 2, pp 732-748, issn 0895-4801, 17 p.Article

Fullerene graphs with exponentially many perfect matchingsDOSLIC, Tomislav.Journal of mathematical chemistry. 2007, Vol 41, Num 2, pp 183-192, issn 0259-9791, 10 p.Article

Connections between Wiener index and matchingsWEIGEN YAN; YEH, Yeong-Nan.Journal of mathematical chemistry. 2006, Vol 39, Num 2, pp 389-399, issn 0259-9791, 11 p.Article

Structuring the elementary components of graphs having a perfect internal matchingBARTHA, Miklos; KRESZ, Miklos.Theoretical computer science. 2003, Vol 299, Num 1-3, pp 179-210, issn 0304-3975, 32 p.Article

Combinatorics of perfect matchings in plane bipartite graphs and application to tilingsFOUMIER, J. C.Theoretical computer science. 2003, Vol 303, Num 2-3, pp 333-351, issn 0304-3975, 19 p.Conference Paper

Geometric representations of binary codes and computation of weight enumeratorsRYTIR, Pavel.Advances in applied mathematics (Print). 2010, Vol 45, Num 2, pp 290-301, issn 0196-8858, 12 p.Article

A quadratic identity for the number of perfect matchings of plane graphsWEIGEN YAN; FUJI ZHANG.Theoretical computer science. 2008, Vol 409, Num 3, pp 405-410, issn 0304-3975, 6 p.Article

A note on minimal matching covered graphsMKRTCHYAN, V. V.Discrete mathematics. 2006, Vol 306, Num 4, pp 452-455, issn 0012-365X, 4 p.Article

Characterizations of trees with equal paired and double domination numbersBLIDIA, Mostafa; CHELLALI, Mustapha; HAYNES, Teresa W et al.Discrete mathematics. 2006, Vol 306, Num 16, pp 1840-1845, issn 0012-365X, 6 p.Article

A comparison between 1-factor count and resonant pattern count in plane non-bipartite graphsHEPING ZHANG; JINGHUA HE.Journal of mathematical chemistry. 2005, Vol 38, Num 3, pp 315-324, issn 0259-9791, 10 p.Article

k-resonance in toroidal polyhexesWAI CHEE SHIU; PETER CHE BOR LAM; HEPING ZHANG et al.Journal of mathematical chemistry. 2005, Vol 38, Num 4, pp 451-466, issn 0259-9791, 16 p.Article

A constraint logic programming approach for generating all perfect matchingsHARARY, F; GUPTA, G.Applied mathematics letters. 2002, Vol 15, Num 8, pp 969-973, issn 0893-9659Article